PENTACLE: Parallelized particle–particle particle-tree code for planet formation
نویسندگان
چکیده
منابع مشابه
A Hybrid N-body–Coagulation Code for Planet Formation
We describe a hybrid algorithm to calculate the formation of planets from an initial ensemble of planetesimals. The algorithm uses a coagulation code to treat the growth of planetesimals into oligarchs and explicit N -body calculations to follow the evolution of oligarchs into planets. To validate the N -body portion of the algorithm, we use a battery of tests in planetary dynamics. Several com...
متن کاملAdaptive parallelism in compiler-parallelized code
As moderate-scale multiprocessors become widely used, we foresee an increased demand for eeective compiler parallelization and eecient management of parallelism. While parallelizing compilers are achieving success at identifying parallelism, they are less adept at predetermining the degree of parallelism in diierent program phases. Thus, a compiler-parallelized application may execute on more p...
متن کاملDisk-Planet Interactions During Planet Formation
The discovery of close orbiting extrasolar giant planets led to extensive studies of disk planet interactions and the forms of migration that can result as a means of accounting for their location. Early work established the type I and type II migration regimes for low mass embedded planets and high mass gap forming planets respectively. While providing an attractive means of accounting for clo...
متن کاملNemo: A parallelized Lagrangian particle-tracking model
Lagrangian particle-tracking models are a computationally intensive, but massively parallelizable method for investigating marine larval dispersal processes, seed dispersal of plants, or a variety of other material transport processes. In order to fully capture the distribution of potential dispersal patterns, highly efficient models with the capacity to simulate tens of millions or more partic...
متن کاملParallelized Sampling-based Path Planning for Tree-structured Rigid Robots
Sampling-based algorithms have become the favored approach for solving path and motion planning problems due to their ability to successfully deal with complex high-dimensional planning scenarios. This thesis presents an overview of existing sampling-based path planning methods for tree-structured rigid robots. The two most prominent algorithm families, Rapidly-exploring Dense Trees and Probabi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications of the Astronomical Society of Japan
سال: 2017
ISSN: 0004-6264,2053-051X
DOI: 10.1093/pasj/psx073